Performs a Bellman-Ford search on a graph
The graph
The starting position
Output: Distance between node and starting position
Output: A node's previous node
See Implementation
Performs a Bellman-Ford search on a graph